A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Let P be a path graph of n vertices embedded in a metric space. We consider the problem of adding a new edge to P such that the diameter of the resulting graph is minimized. Previously (in ICALP 2015) the problem was solved in O(n log3 n) time. In this paper, based on new observations and different algorithmic techniques, we present an O(n logn) time algorithm.
متن کاملFast Algorithms for Diameter-Optimally Augmenting Paths
We consider the problem of augmenting a graph with n vertices embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present an exact algorithm for the cases when the input graph is a path that runs in O(n log n) time. We also present an algorithm that computes a (1 + ε)approximation in O(n+1/ε) time for paths in R, where d is a...
متن کاملFast Algorithms for Diameter-Optimally Augmenting Paths and Trees
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n log n) time, and (ii) the input graph is a tree, running in O(n2 logn) time. We also present an algorithm for paths that computes...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
A Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2021
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195920500089